On the convergence of splittings for semidefinite linear systems

نویسندگان

  • Lijing Lin
  • Yimin Wei
  • Ching-Wah Woo
  • Jieyong Zhou
  • Jinbiao Wu
  • Jinchao Xu
  • Ludmil Zikatanov
چکیده

Recently, Lee et al. [Young-ju Lee, Jinbiao Wu, Jinchao Xu, Ludmil Zikatanov, On the convergence of iterative methods for semidefinite linear systems, SIAM J. Matrix Anal. Appl. 28 (2006) 634–641] introduce new criteria for the semi-convergence of general iterative methods for semidefinite linear systems based on matrix splitting. The new conditions generalize the classical notion of P-regularity introduced by Keller [H.B. Keller, On the solution of singular and semidefinite linear systems by iterations, SIAM J. Numer. Anal. 2 (1965) 281–290]. In view of their results, we consider here stipulations on a splitting A = M −N , which lead to fixed point systems such that, the iterative scheme converges to a weighted Moore–Penrose solution to the system Ax = b. Our results extend the result of Lee et al. to a more general case and we also show that it requires less restrictions on the splittings than Keller’s P-regularity condition to ensure the convergence of iterative scheme. © 2008 Elsevier Inc. All rights reserved. AMS classification: 65F10; 65F15

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Necessary Conditions for Convergence of Stationary Iterative Methods for Hermitian Definite and Semidefinite Linear Systems∗

In an earlier paper [SIAM J. Matrix Anal. Appl. vol. 30 (2008), 925–938] we gave sufficient conditions in terms of an energy seminorm for the convergence of stationary iterations for solving singular linear systems whose coefficient matrix is Hermitian and positive semidefinite. In this paper we show in which cases these conditions are also necessary, and show that they are not necesary in othe...

متن کامل

A Recurrent Neural Network Model for Solving Linear Semidefinite Programming

In this paper we solve a wide rang of Semidefinite Programming (SDP) Problem by using Recurrent Neural Networks (RNNs). SDP is an important numerical tool for analysis and synthesis in systems and control theory. First we reformulate the problem to a linear programming problem, second we reformulate it to a first order system of ordinary differential equations. Then a recurrent neural network...

متن کامل

Multi - Splittings of Matrices and Parallel Solution of Linear Systems * Dianne

We present two classes of matrix splittings and give applications to the parallel iterative solution of systems of linear equations. These splittings generalize regular splittings and P-regular splittings, resulting in algorithms which can be implemented efficiently on parallel computing systems. Convergence is established, rate of convergence is discussed, and numerical examples are given.

متن کامل

Convergence of a semi-analytical method on the fuzzy linear systems

In this paper, we apply the  homotopy analysis method (HAM) for solving fuzzy  linear systems and present  the necessary and sufficient conditions for the convergence of series solution obtained via the HAM. Also, we present a new criterion for choosing a proper value of convergence-control parameter $hbar$ when the HAM is applied to linear system of equations. Comparisons are made between the ...

متن کامل

On the convergence of subproper (multi)-splitting methods for solving rectangular linear systems

We give a convergence criterion for stationary iterative schemes based on subproper splittings for solving rectangular systems and show that, for special splittings, convergence and quotient convergence are equivalent. We also analyze the convergence of multisplitting algorithms for the solution of rectangular systems when the coefficient matrices have special properties and the linear systems ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007